Solving satisfiability in combinational circuits
نویسندگان
چکیده
منابع مشابه
Algorithms for Solving Boolean Satisfiability in Combinational Circuits
Boolean Satisfiability is a ubiquitous modeling tool in Electronic Design Automation, It finds application in test pattern generation, delay-fault testing, combinational equivalence checking and circuit delay computation, among many other problems. Moreover, Boolean Satisfiability is in the core of algorithms for solving Binate Covering Problems. This paper describes how Boolean Satisfiability ...
متن کاملSearch Algorithms for Satisfiability Problems in Combinational Switching Circuits
SEARCH ALGORITHMS FOR SATISFIABILITY PROBLEMS IN COMBINATIONAL SWITCHING CIRCUITS by João Paulo Marques da Silva Chair: Karem A. Sakallah A number of tasks in computer-aided analysis of combinational circuits, including test pattern generation, timing analysis, delay fault testing and logic verification, can be viewed as particular formulations of the satisfiability problem (SAT). The first pur...
متن کاملCombinational test generation using satisfiability
We present a robust and efficient algorithm for combinational test generation using a reduction to satisfiability (SAT). The algorithm, TEGUS, has the following features. We choose a form for the test set characteristic equation which minimizes its size. The simplified equation is solved by an algorithm for SAT using simple, but powerful, greedy heuristics, ordering the variables using depth-fi...
متن کاملAlgorithms for Satisfiability in Combinational Circuits Based on Backtrack Search and Recursive Learning
Boolean Satisfiability is a ubiquitous modeling tool in Electronic Design Automation (EDA). It finds application in test pattern generation, delay-fault testing, combinational equivalence checking and circuit delay computation, among many other problems. Moreover, Boolean Satisfiability is also in the core of algorithms for solving Binate Covering Problems. This paper starts by describing how B...
متن کاملSatisfiability-Based Test Generator for Path Delay Faults in Combinational Circuits
This paper describes a new Boolean satisfiability based formulation to generate robust tests for path delay faults in combinational circuits. Conditions to detect a target path delay fault are represented by a Boolean formula. Unlike the technique described in [30], which extracts the formula for each path delay fault, the proposed formulation needs to extract the formula only once for each cir...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Design & Test of Computers
سال: 2003
ISSN: 0740-7475
DOI: 10.1109/mdt.2003.1214348